Non-Coherent Space-Time Coding with finite alphabet constraint
We consider the problem of designing Space-Time Codes in the noncoherent case.
Our goal is to construct maximal diversity space-time codewords X,
subject to the constraint that the elements of X are taken from a fixed
constellation. Using an interpretation of the well-known pairwise error
probability for noncoherent receiver in
terms of principal angles between subspaces,
we consider the construction of non-intersecting subspaces
on finite alphabets.
F. E. Oggier, N. J. A. Sloane, S. N.
Diggavi and A. R. Calderbank.
"Nonintersecting Subspaces Based on Finite Alphabets",
ISIT 2004, Chicago.
and
F. E. Oggier, N. J. A. Sloane, S. N.
Diggavi and A. R. Calderbank.
"Nonintersecting Subspaces Based on Finite Alphabets",
IEEE Transactions on Information Theory, vol. 51, n.12,
pp. 4320-4325, December 2005.
Joint work with
N.J.A. Sloane and
S. Diggavi .
Last update: December 18 2005